package leetcode;

public class LeetCode105 {
    //前序 中左右
    //中序 左中右
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        TreeNode root = new TreeNode(preorder[0]);
        int n = preorder.length;
        for (int i = 0; i < n; i++) {

        }
        return root;
    }

    private boolean isLeft(int x, int parent, int[] inorder) {
        int i = 0;
        while (inorder[i] != x) {
            if (inorder[i] == parent)
                return false;
            i++;
        }
        return true;
    }
//------------------------------------------------------------------
}
